Limit results for Markovian models of TCP

We study in this paper the throughput of a TCP connection performing ideal congestion avoidance. With respect to existing studies published on the same topic, we determine upper and lower bounds for the throughput of a TCP connection experiencing an arbitrary constant loss. We then derive exact convergence results when the loss probability becomes arbitrarily small. A remarkable property of the results obtained in this paper is that they justify a posteriori constants, which appear in the approximation of the throughput and which has been observed earlier via simulation or experiments. The analysis is performed by assuming a finite and infinite maximum congestion window size.